Grid Drawings of Four-Connected Plane Graphs
نویسندگان
چکیده
A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on plane grid points and all edges are drawn as straight line segments between their endpoints without any edge-intersection. In this paper we give a very simple algorithm to find a grid drawing of any given 4-connected plane graph G with four or more vertices on the outer face. The algorithm takes time O(n) and needs a rectangular grid of width dn/2e−1 and height dn/2e if G has n vertices. The algorithm is best possible in the sense that there are an infinite number of 4-connected plane graphs any grid drawings of which need rectangular grids of width dn/2e − 1 and height dn/2e.
منابع مشابه
Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
A rectangle-of-in uence drawing of a plane graph G is a straight-line planar drawing of G such that there is no vertex in the proper inside of the axis-parallel rectangle de ned by the two ends of any edge. In this paper, we show that any 4-connected plane graph G with four or more vertices on the outer face has a rectangle-of-in uence drawing in an integer grid such that W + H n, where n is th...
متن کاملConvex Grid Drwaings of Four-Connected Plane Graphs
A convex grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on grid points, all edges are drawn as straight-line segments between their endpoints without any edge-intersection, and every face boundary is a convex polygon. In this paper we give a linear-time algorithm for finding a convex grid drawing of any 4-connected plane graph G with four or mor...
متن کاملDrawing High-degree Graphs with Small Grid-size Drawing High-degree Graphs with Small Grid-size
In this paper, we present a general scheme to produce interactive and static orthogonal drawings of graphs. As opposed to most known algorithms, we do not restrict ourselves to graph with maximum degree 4, but allow arbitrary degrees. We show here how, with one speciic implementation of the scheme, we can obtain an m+n 2 m+n 2-grid for all simple connected graphs without nodes of degree 1. Furt...
متن کاملConvex Grid Drawings of 3-Connected Planar Graphs
We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, non-intersecting line segments and faces are convex polygons. We present a linear-time algorithm which, given an n-vertex 3connected plane graph G (with n 3), nds such a straight-line convex embedding of G into a (n 2) (n 2) grid.
متن کاملStraight-Line Grid Drawings of 3-Connected 1-Planar Graphs
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1-planar graphs do not admit straightline drawings. We show that every 3-connected 1-planar graph has a straight-line drawing on an integer grid of quadratic size, with the exception of a single edge on the outer face that has one bend. The drawing can be computed in linear time from any...
متن کامل